Fast Robot-Obstacles Distance Evaluation in the Depth Space
نویسنده
چکیده
A robot-obstacle distance evaluation algorithm is described in this thesis which directly operates on the image given by a depth sensor, also known as Depth Space. The algorithm’s main features are that the entire visible part of the robot is accurately surveyed and that the different robot links are separately considered for the minimum robot-obstacle distance. Several design parameters are described and evaluated, introduced mainly to improve the algorithm’s time performance. Possible implementations of the algorithm with the respective design parameters are given both for a CPU and a GPU. Performance results of the CPU and GPU implementations, in terms of accuracy and computational time, are provided and compared for different parameter values. The implementation on the GPU outperforms the one on the CPU clearly, especially concerning the execution time. With well chosen parameter values, the algorithm on the GPU can reach cycle times of 1000 Hz, by simultaneous providing accurate results.
منابع مشابه
A New Method of Mobile Robot Navigation: Shortest Null Space
In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...
متن کامل3D Collision Detection for Industrial Robots and Unknown Obstacles using Multiple Depth Images
In current industrial applications without sensor surveillance, the robot workcell needs to be rather static. If the environment of the robot changes in an unplanned manner, e. g. a human enters the workcell and crosses the trajectory, a collision could result. Current research aims at relaxing the separation of robot and human workspaces. We present the first approach that uses multiple 3D dep...
متن کاملA New Method of Mobile Robot Navigation: Shortest Null Space
In this paper, a new method was proposed for the navigation of a mobile robot in an unknown dynamic environment. The robot could detect only a limited radius of its surrounding with its sensors and it went on the shortest null space (SNS) toward the goal. In the case of no obstacle, SNS was a direct path from the robot to goal; however, in the presence of obstacles, SNS was a space around the r...
متن کاملمسیریابی حرکت روباتهای ماشینواره با روش پیشروی سریع
The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...
متن کاملDynamic Obstacle Avoidance by Distributed Algorithm based on Reinforcement Learning (RESEARCH NOTE)
In this paper we focus on the application of reinforcement learning to obstacle avoidance in dynamic Environments in wireless sensor networks. A distributed algorithm based on reinforcement learning is developed for sensor networks to guide mobile robot through the dynamic obstacles. The sensor network models the danger of the area under coverage as obstacles, and has the property of adoption o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015